MPRI - Parisian Master of Research in Computer Science <br />Course 2.11.1: Approximation Algorithms, Randomization & Nature Programming <br />Nicolas SCHABANEL, CNRS - Université Paris Diderot <br /> <br />LECTURE 6 (2016/11/2) <br />NATURE PROGRAMMING: UNIVERSALITY IN TILE ASSEMBLY SYSTEMS <br /> <br />[0:00:00] 0. HW4: NP-completeness & Optimization Problems <br />[0:05:43] 1. Turing Universality in tile assembly systems <br />[0:12:31] 2. Turing universality at T°=2 <br />[0:36:19] 3. Turing universality at T°=1 <br />[1:19:04] 4. Minimzing the number of tiles to build a shape <br />[2:31:39] 5. HW5(2): Assembly time, rank & concentrations
